Cross-Intersecting Erdős-Ko-Rado Sets in Finite Classical Polar Spaces

نویسنده

  • Ferdinand Ihringer
چکیده

A cross-intersecting Erdős-Ko-Rado set of generators of a finite classical polar space is a pair (Y,Z) of sets of generators such that all y ∈ Y and z ∈ Z intersect in at least a point. We provide upper bounds on |Y | · |Z| and classify the crossintersecting Erdős-Ko-Rado sets of maximum size with respect to |Y | · |Z| for all polar spaces except some Hermitian polar spaces.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Theorems of Erdos-Ko-Rado type in polar spaces

We consider Erdős-Ko-Rado sets of generators in classical finite polar spaces. These are sets of generators that all intersect non-trivially. We characterize the Erdős-Ko-Rado sets of generators of maximum size in all polar spaces, except for H(4n+ 1, q) with n ≥ 2.

متن کامل

On the maximum size of Erdős-Ko-Rado sets in $$H(2d+1, q^2)$$

Erdős-Ko-Rado sets in finite classical polar spaces are sets of generators that intersect pairwise non-trivially. We improve the known upper bound for Erdős-Ko-Rado sets in H(2d + 1, q) for d > 2 and d even from approximately q +d to q 2+1.

متن کامل

Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem

We study the possibility of the existence of a Katona type proof for the Erdős-Ko-Rado theorem for 2and 3-intersecting families of sets. An Erdős-Ko-Rado type theorem for 2-intersecting integer arithmetic progressions and a model theoretic argument show that such an approach works in the 2-intersecting case.

متن کامل

Uniform s-Cross-Intersecting Families

In this paper we study a question related to the classical Erdős–Ko–Rado theorem, which states that any family of k-element subsets of the set [n] = {1, . . . , n} in which any two sets intersect, has cardinality at most (︀ n−1 k−1 )︀ . We say that two non-empty families are A,B ⊂ (︀[n] k )︀ are s-cross-intersecting, if for any A ∈ A, B ∈ B we have |A ∩ B| ≥ s. In this paper we determine the ma...

متن کامل

Regular bipartite graphs and intersecting families

In this paper we present a simple unifying approach to prove several statements about intersecting and cross-intersecting families, including the Erdős–Ko–Rado theorem, the Hilton–Milner theorem, a theorem due to Frankl concerning the size of intersecting families with bounded maximal degree, and versions of results on the sum of sizes of non-empty cross-intersecting families due to Frankl and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2015